A Random-Line-Graph Approach to Overlapping Line Segments
نویسندگان
چکیده
منابع مشابه
Line graphs associated to the maximal graph
Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphi...
متن کاملAn axiomatic approach to clustering line-segments
In this paper we consider the problem of clustering line-segments into new ones. The clustering-hierarchy gives an answer to the question what original line segments are combined into larger ones. Such a clustering is deened as a hierarchical ordering of a set of line-segments. Criteria on a clustering-method are presented. The diierence between edges and lines in relation to scale-invariant cl...
متن کاملOn a planar matching in line segments endpoints visibility graph
We show that the segment endpoint visibility graph of any finite set of 2n line segments contains a planar matching that does not use any segment edge, if the line segments in our set are convexly independent.
متن کاملConstructing the Visibility Graph for N Line Segments in On
There are many problems in computational geometry for which the best know algorithms take time (n) (or more) in the worst case while only very low lower bounds are known. In this paper we describe a large class of problems for which we prove that they are all at least as di cult as the following base problem 3sum: Given a set S of n integers, are there three elements of S that sum up to 0. We c...
متن کاملA Signal-Flow-Graph Approach to On-line Gradient Calculation
A large class of nonlinear dynamic adaptive systems such as dynamic recurrent neural networks can be effectively represented by signal flow graphs (SFGs). By this method, complex systems are described as a general connection of many simple components, each of them implementing a simple one-input, one-output transformation, as in an electrical circuit. Even if graph representations are popular i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complex Networks
سال: 2020
ISSN: 2051-1329
DOI: 10.1093/comnet/cnaa029